Discrete Bernoulli Convolutions: an Algorithmic Approach toward Bound Improvement
نویسندگان
چکیده
In this paper we consider a discrete version of the Bernoulli convolution problem traditionally studied via functional analysis. We develop an algorithm which bounds the Bernoulli sequences, and we give a significant improvement on the best known bound.
منابع مشابه
Taking the Convoluted out of Bernoulli Convolutions: a Discrete Approach
In this paper we consider a discrete version of the Bernoulli convolution problem [6] traditionally studied via functional analysis. We discuss several innovative algorithms for computing the sequences with this new approach. In particular, these algorithms assist us in gathering data regarding the maximum values. By looking at a family of associated polynomials, we gain insight on the local be...
متن کاملSpacings and Pair Correlations for Finite Bernoulli Convolutions
We consider finite Bernoulli convolutions with a parameter 1/2 < λ < 1 supported on a discrete point set, generically of size 2 . These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure νλ, as N → ∞. Numerical evidence suggests that for a generic λ, the distribution of spacings between appropriately rescaled points is Poissonian. We obtain some parti...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملConcavity of entropy along binomial convolutions
Motivated by a generalization of Sturm-Lott-Villani theory to discrete spaces and by a conjecture stated by Shepp and Olkin about the entropy of sums of Bernoulli random variables, we prove the concavity in t of the entropy of the convolution of a probability measure a, which has the law of a sum of independent Bernoulli variables, by the binomial measure of parameters n ≥ 1 and t.
متن کاملOn the Gibbs properties of Bernoulli convolutions
We consider infinitely convolved Bernoulli measures (or simply Bernoulli convolutions) related to the β-numeration. A matrix decomposition of these measures is obtained in the case when β is a PV number. We also determine their Gibbs properties for β being a multinacci number, which makes the multifractal analysis of the corresponding Bernoulli convolution possible.
متن کامل